package com.hspedu.newData.dmsxl.动态规划;
/**
 * @Author: yh
 * @description: 
 * @CreateTime: 2025-05-25 
 * @Version: 1.0
 */

public class LC718最长重复子数组 {

    public int findLength(int[] nums1, int[] nums2) {

        int len1 = nums1.length;
        int len2 = nums2.length;
        int[][] dp = new int[len1][len2];

        int result = 0;

        for (int i = 1; i <= len1; i++) {
            for (int j = 1; j <= len2; j++) {
                if (nums1[i-1]==nums2[j-1]){
                    dp[i][j] = dp[i-1][j-1]+1;
                    result = Math.max(dp[i][j],result);
                }
            }
        }
        return result;
    }

}
